Contemporary Mathematics On the Uniqueness of Barycentric Coordinates

نویسنده

  • Joe Warren
چکیده

Given a convex polytope P , a set of coordinate functions attached to the vertices of P is barycentric if the functions are non-negative on P and reproduce linear functions sampled at the vertices of P . Warren (1996) describes a construction for rational barycentric coordinate functions of degree n d where d is the dimension of P and n is the number of facets of P . In this paper, we show that any rational coordinates functions of degree n d that are barycentric on P are unique and of minimal degree.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Barycentric Coordinates on Surfaces

This paper introduces a method for defining and efficiently computing barycentric coordinates with respect to polygons on general surfaces. Our construction is geared towards injective polygons (polygons that can be enclosed in a metric ball of an appropriate size) and is based on replacing the linear precision property of planar coordinates by a requirement in terms of center of mass, and gene...

متن کامل

Metrical relations in barycentric coordinates

Let ∆ be the area of the fundamental triangle ABC of barycentric coordinates and let α = cotA, β = cotB, γ = cotC. The vectors vi = [xi, yi, zi] (i = 1, 2) have the scalar product 2∆(αx1x2 + βy1y2 + γz1z2). This fact implies all important formulas about metrical relations of points and lines. The main and probably new results are Theorems 1 and 8.

متن کامل

Generalized barycentric coordinates and approximations of convex functions on arbitrary convex polytopes

In this paper, we study the error in the approximation of a convex function obtained via a one-parameter family of approximation schemes, which we refer to as barycentric approximation schemes. For a given finite set of pairwise distinct points Xn := {xi}ni=0 in R, the barycentric approximation of a convex function f is of the form:

متن کامل

Discrete Harmonic Functions from Local Coordinates

In this work we focus on approximations of continuous harmonic functions by discrete harmonic functions based on the discrete Laplacian in a triangulation of a point set. We show how the choice of edge weights based on generalized barycentric coordinates influences the approximation quality of discrete harmonic functions. Furthermore, we consider a varying point set to demonstrate that generali...

متن کامل

Approximations of differentiable convex functions on arbitrary convex polytopes

Let Xn := {xi}ni=0 be a given set of (n + 1) pairwise distinct points in R (called nodes or sample points), let P = conv(Xn), let f be a convex function with Lipschitz continuous gradient on P and λ := {λi}ni=0 be a set of barycentric coordinates with respect to the point set Xn. We analyze the error estimate between f and its barycentric approximation:

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003